Basic algorithms for random sampling and treatment randomization.
نویسنده
چکیده
Five BASIC programs to select random samples from populations or to randomize treatments are presented. Program 1 is used to obtain randomization of any number of treatments in an equal number of positions or test units for any number of replicates. Program 2 produces latin squares of any size for treatment randomization. Program 3 is used to obtain a specific number of randomly selected samples from a population without replacement. Program 4 produces quasi-latin squares that have treatments repeated equally in all rows and columns, with identical treatments either spaced or not. Program 5 can be used with any size grid to place 3-100 treatments in equal proportions and with spacing of identical treatments. Both programs 4 and 5 allow for horizontal and vertical separation between identical treatments at sampling places while still retaining the quality of randomness. These programs should facilitate random sampling and randomization procedures which are required to correctly analyze experiments by the methods of statistical probability.
منابع مشابه
Randomized algorithms in numerical linear algebra
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems approximately, including matrix multiplication, regression and low-rank approximation. The survey describes the key ideas and gives complete proofs of the main results in the field. A...
متن کاملExtending robustness & randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملIncremental Constraint Projection-Proximal Methods for Nonsmooth Convex Optimization
We consider convex optimization problems with structures that are suitable for stochastic sampling. In particular, we focus on problems where the objective function is an expected value or is a sum of a large number of component functions, and the constraint set is the intersection of a large number of simpler sets. We propose an algorithmic framework for projection-proximal methods using rando...
متن کاملRandomized Algorithms for Matrices and Data
Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by problems in large-scale data analysis, largely since matrices are popular structures with which to model data drawn from a wide range of application domains, and this work was performed by individuals from many different research communities. While the...
متن کاملAlgorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
DRAFT OF A PAPER PUBLISHED IN EA’2005 : Anne Auger, Mohamed Jebalia, Olivier Teytaud. (X,sigma,eta) : quasi-random mutations for Evolution Strategies. Proceedings of Evolutionary Algorihtms’2005, 12 pages. Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic aspect of evolution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers in biology and medicine
دوره 21 1-2 شماره
صفحات -
تاریخ انتشار 1991